backward chaining - определение. Что такое backward chaining
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое backward chaining - определение

METHOD OF FORMING INFERENCES
Working backward from the goal; Backward reasoning; Backwards reasoning; Goal-oriented inference
  • An Example of Backward Chaining.
Найдено результатов: 144
backward chaining         
<algorithm> An algorithm for proving a goal by recursively breaking it down into sub-goals and trying to prove these until facts are reached. Facts are goals with no sub-goals which are therefore always true. Backward training is the program execution mechanism used by most logic programming language like Prolog. Opposite: forward chaining. (2004-01-26)
Backward chaining         
Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.
Backward chaining (applied behavior analysis)         
TECHNIQUE USED IN APPLIED BEHAVIOR ANALYSIS TO TEACH INDIVIDUALS WITH DEVELOPMENTAL DISABILITIES COMPLEX TASKS BY BREAKING THEM DOWN INTO DISCRETE RESPONSES OR INDIVIDUAL BEHAVIORS
Backward Chaining (Applied Behavior Analysis)
Chaining is a technique used in applied behavior analysis to teach complex tasks by breaking them down into discrete responses or individual behaviors that are part of a task analysis. With a backward chaining procedure the learning can happen in two ways.
Forward chaining         
Forward-chaining
Forward chaining (or forward reasoning) is one of the two main methods of reasoning when using an inference engine and can be described logically as repeated application of modus ponens. Forward chaining is a popular implementation strategy for expert systems, business and production rule systems.
forward chaining         
Forward-chaining
A data-driven technique used in constructing goals or reaching inferences derived from a set of facts. Forward chaining is the basis of production systems. Oppose backward chaining. (1994-10-28)
Forward–backward algorithm         
HIDDEN MARKOV MODEL INFERENCE ALGORITHM WHICH COMPUTES THE POSTERIOR MARGINALS OF ALL HIDDEN STATE VARIABLES GIVEN A SEQUENCE OF OBSERVATIONS, MAKING USE OF DYNAMIC PROGRAMMING TO MAKE ONLY 2 PASSES: ONE FORWARD, ONE BACKWARD
Forward/backward algorithm; Posterior decoding; Forward-backward algorithm
The forward–backward algorithm is an inference algorithm for hidden Markov models which computes the posterior marginals of all hidden state variables given a sequence of observations/emissions o_{1:T}:= o_1,\dots,o_T, i.e.
Backward differentiation formula         
NUMERICAL METHOD FOR SOLVING ORDINARY DIFFERENTIAL EQUATIONS
Backward Differentiation Formula; Gear solver
The backward differentiation formula (BDF) is a family of implicit methods for the numerical integration of ordinary differential equations. They are linear multistep methods that, for a given function and time, approximate the derivative of that function using information from already computed time points, thereby increasing the accuracy of the approximation.
Backward Euler method         
  • The pink region outside the disk shows the stability region of the backward Euler method.
NUMERICAL METHOD FOR SOLVING DIFFERENTIAL EQUATIONS
Euler backward method; Euler's backward method; Implicit Euler method
In numerical analysis and scientific computing, the backward Euler method (or implicit Euler method) is one of the most basic numerical methods for the solution of ordinary differential equations. It is similar to the (standard) Euler method, but differs in that it is an implicit method.
Looking Backward         
NOVEL BY EDWARD BELLAMY
Looking Backward: 2000-1887; Looking Backwards
Looking Backward: 2000–1887 is a utopian science fiction novel by Edward Bellamy, a journalist and writer from Chicopee Falls, Massachusetts; it was first published in 1888.Edward Bellamy in Encyclopedia of science fiction
backwards compatible         
PROPERTY OF A SYSTEM, PRODUCT, OR TECHNOLOGY THAT ALLOWS FOR INTEROPERABILITY WITH AN OLDER LEGACY SYSTEM, OR WITH INPUT DESIGNED FOR SUCH A SYSTEM, ESPECIALLY IN TELECOMMUNICATIONS AND COMPUTING
Backwards compatibility; Backward compatible; Backward-compatible; Backwards compatible; Backwards-compatible; Backward-compatibility; Backwards-compatibility; Downward compatible; Backwards Compatibility; Backwards compatability; Downward compatibility; Downward Compatibility; Hysterical raisins; Format rot; Legacy compatibility; Bugwards compatible; Bugwards compatibility; Bugward compatible; Bugward compatibility; Backward-incompatible; Breaking changes; Breaking change; Translation compatibility; Hysterical reasons; Retrocompatibility; Retrocompatible

Википедия

Backward chaining

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. It is used in automated theorem provers, inference engines, proof assistants, and other artificial intelligence applications.

In game theory, researchers apply it to (simpler) subgames to find a solution to the game, in a process called backward induction. In chess, it is called retrograde analysis, and it is used to generate table bases for chess endgames for computer chess.

Backward chaining is implemented in logic programming by SLD resolution. Both rules are based on the modus ponens inference rule. It is one of the two most commonly used methods of reasoning with inference rules and logical implications – the other is forward chaining. Backward chaining systems usually employ a depth-first search strategy, e.g. Prolog.